CARPOOL: Connectivity Plan Routing Protocol

نویسندگان

  • Ioannis Komnios
  • Vassilis Tsaoussidis
چکیده

Basic Internet access is considered a human right, however geographical, technological and socio-economic reasons set barriers to universal Internet access. To address this challenge, we have proposed an access method based on message ferrying that enables free delay-tolerant Internet access to all, and developed Connectivity plAn Routing PrOtOcOL (CARPOOL), a reference routing protocol for the proposed access method. In this paper, we describe CARPOOL in depth and evaluate its performance for increasing traffic load. Focusing on an urban scenario, where means of public transport, such as buses, follow predefined routes and schedules, CARPOOL utilises a priori knowledge about their current location to extend Internet access provided by hotspots to users and areas that are not typically covered. Our simulation results show that CARPOOL effectively exploits the existing connectivity plan of public transportation, achieving high delivery ratio with minimum overhead. This paper also discusses possible enhancements of the proposed routing protocol.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol

The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...

متن کامل

Leach Routing Algorithm Optimization through Imperialist Approach

Routing is an important challenge in WSN due to the presence of hundreds or thousands of sensor nodes. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical routing and data dissemination protocol. LEACH divides a network domain into several sub-domains that are called clusters. Non-uniformity of cluster distribution and CHs selection without considering the positions of other sens...

متن کامل

Routing in Wireless Networks with Intermittent Connectivity

Definition: Wireless networks with intermittent connectivity (also called Delay or Disruption Tolerant Networks), are characterized by sporadic availability of end-to-end paths between end hosts. Existing TCP/IP packet routing protocols cannot cope with the lack of reliable end-to-end connectivity. New routing mechanisms are necessary. The Internet has been exceedingly successful in establishin...

متن کامل

An Enhanced Connectivity Aware Routing Protocol for Vehicular Ad hoc Networks

This study proposed an Enhanced Connectivity Aware Routing (ECAR) protocol for Vehicular Ad hoc Network (VANET). The protocol uses a control broadcast to reduce the number of overhead packets needed in a route discovery process. It is also equipped with an alternative backup route that is used whenever a primary path to destination failed, which highly reduces the frequent launching and re-laun...

متن کامل

A routing algorithm for connection-oriented Low Earth Orbit (LEO) satellite networks with dynamic connectivity

Low Earth Orbit (LEO) satellites move with respect to a fixed observer on the Earth surface. Satellites in the polar regions and the seam switch off their intersatellite links to the neighbor satellites. As a result, the connectivity pattern of the network changes. Ongoing calls passing through these links need to be rerouted. A large number of simultaneous rerouting attempts would cause excess...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014